Absolute minimal trellis complexities of extended codes and their dual codes of two types of linear block codes whose code length is odd are given 給出了兩類奇數(shù)碼長線性分組碼的擴(kuò)展碼及其對偶碼的絕對最小網(wǎng)格圖復(fù)雜度。
Although the estimation algorithm is carried out by parity check code , but it is also applicable in general linear block codes to estimate the channel ’ s parameter 本文算法不僅可以利用偶校驗(yàn)碼的碼結(jié)構(gòu)去估計(jì)信道參數(shù),而且對于一般的線性分組碼也適用。
The other is the modified hamming bound , also the geometry of the bound is introduced . the fourth chapter is about the linear block codes and their unequal error protection capability 第三章主要證明了兩個(gè)關(guān)于非均勻保護(hù)的性能限,這兩個(gè)性能限不僅對線性碼有效,對非線性碼同樣有效。